The differences between distributed shared memory caching and proxy caching
نویسندگان
چکیده
منابع مشابه
Cost-based Proxy Caching
Caching has been used for decades as an effective performance enhancing technique in computer systems, among others. However, the traditional cache replacement algorithms are not easily applicable to WWW applications. Moreover, the frequently used hit-ratio and byte-hit ratio are not appropriate measures in WWW applications, because non-uniformity of the object sizes and non-uniformity cost of ...
متن کاملThe Differences between Distributed Shared Memory
DSM caching has been an active research area since the early 1980s and proxy caching since the early 1990s.6 In spite of the similarities between DSM and proxy caching, there are several remarkable differences that we can study from the point of view of the three major system layers: architecture, organization, and design. In this article, the term architecture refers to the system’s functional...
متن کاملWeb Caching Architectures: Hierarchical and Distributed Caching
Web caches are installed to reduce the receivers’ latency and save network bandwidth. These caches need to cooperate in order to improve their performance. A popular technique to make caches cooperate is by setting up a caching hierarchy. However, there are several problems associated with a caching hierarchy: i) every hierarchy level introduces additional delay, ii) redundant document copies a...
متن کاملAdaptive Performance-Aware Distributed Memory Caching
Distributed in-memory caching systems such as memcached have become crucial for improving the performance of web applications. However, memcached by itself does not control which node is responsible for each data object, and inefficient partitioning schemes can easily lead to load imbalances. Further, a statically sized memcached cluster can be insufficient or inefficient when demand rises and ...
متن کاملAdaptive Distributed Caching with Minimal Memory Usage
We have shown previously that our Adaptive Distributed Caching (ADC) algorithm is able to compete with typical hashing based approaches in the realm of distributed proxy systems. In our first approach, we allowed the algorithm to run with the assumption of unlimited system resources (e.g. physical RAM). In this paper we introduce an extension to ADC, which gives the algorithm the capability to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Concurrency
سال: 2000
ISSN: 1092-3063,1558-0849
DOI: 10.1109/4434.865892